A Newton-Krylov-FETI-DP Method with an Adaptive Coarse Space Applied to Elastoplasticity
نویسندگان
چکیده
We consider a Newton-Krylov-FETI-DP algorithm to solve problems in elastoplasticity. First, the material model and its discretization will be described. The model contains a Prandtl-Reuss flow rule and a von Mises flow function. We restrict ourselves to the case of perfect elastoplasticity; thus, there is no hardening. For more information on elastoplasticity; see, e.g., Carstensen and Klose [2002], Han and Reddy [2013], Simo and Hughes [1998]. In this material model we will have local nonlinearities introduced by plastic material behavior in activated zones of the domain. For the finite element discretization we follow the framework given in Carstensen and Klose [2002]. Second, we will briefly present the linearization and the FETI-DP method which is used to solve the linearized problems. For more details on the FETIDP algorithm, see, e.g., Klawonn et al. [2002, 2008], Farhat et al. [2001], Toselli and Widlund [2005]. The convergence of the Newton-Krylov-FETIDP method using a standard coarse space with vertices and edge averages can deteriorate when the plastically activated zone intersects the interface introduced by the domain decomposition. In this case, we use an adaptive coarse space which successfully decreases the number of cg iterations and the condition numbers of the preconditioned linearized systems. Only a small amount of adaptive constraints is needed if the plastically activated zone is
منابع مشابه
A 738
New nonlinear FETI-DP (dual-primal finite element tearing and interconnecting) and BDDC (balancing domain decomposition by constraints) domain decomposition methods are introduced. In all these methods, in each iteration, local nonlinear problems are solved on the subdomains. The new approaches can significantly reduce communication and show a significantly improved performance, especially for ...
متن کاملNonlinear FETI-DP and BDDC Methods
New nonlinear FETI-DP (dual-primal finite element tearing and interconnecting) and BDDC (balancing domain decomposition by constraints) domain decomposition methods are introduced. In all these methods, in each iteration, local nonlinear problems are solved on the subdomains. The new approaches can significantly reduce communication and show a significantly improved performance, especially for ...
متن کاملOn an Adaptive Coarse Space and on Nonlinear Domain Decomposition
We consider two different aspects of FETI-DP domain decomposition methods [8, 23]. In the first part, we describe an adaptive construction of coarse spaces from local eigenvalue problems for the solution of heterogeneous, e.g., multiscale, problems. This strategy of constructing a coarse space is implemented using a deflation approach. In the second part, we introduce new domain decomposition a...
متن کاملAdaptive Selection of Face Coarse Degrees of Freedom in the BDDC and the FETI-DP Iterative Substructuring Methods
We propose a class of method for the adaptive selection of the coarse space of the BDDC and FETI-DP iterative substructuring methods. The methods work by adding coarse degrees of freedom constructed from eigenvectors associated with intersections of selected pairs of adjacent substructures. It is assumed that the starting coarse degrees of freedom are already sufficient to prevent relative rigi...
متن کاملAdaptive Coarse Space Selection in the BDDC and the FETI-DP Iterative Substructuring Methods: Optimal Face Degrees of Freedom
We propose adaptive selection of the coarse space of the BDDC and FETI-DP iterative substructuring methods by adding coarse degrees of freedom (dofs) on faces between substructures constructed using eigenvectors associated with the faces. Provably the minimal number of coarse dofs on the faces is added to decrease the condition number estimate under a target value specified a priori. It is assu...
متن کامل